Characterizing Star-PCGs
نویسندگان
چکیده
منابع مشابه
Characterizing Star-PCGs
A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T,w, dmin, dmax) of a tree T whose leaf set is equal to the vertex set of G, a non-negative edge weight w, and two non-negative reals dmin ≤ dmax such that G has an edge between two vertices u, v ∈ V if and only if the distance between the two leaves u and v in the weighted tree (T, w) is in the interval [...
متن کاملOn PCGS and FRR-automata
This paper presents the second part of the technical report [7] in which the study of the relation between Parallel Communicating Grammar Systems (PCGS) and Freely Rewriting Restarting Automata (FRR) has been initiated. The rst part of [7] is presented in [6]. Here, the distribution and generation complexity for PCGS are introduced and studied. It is shown that analysis by reduction for PCGS wi...
متن کاملOn Graphs That Are Not PCGs
Let T be an edge weighted tree and let dmin, dmax be two nonnegative real numbers. Then the pairwise compatibility graph (PCG) of T is a graph G such that each vertex of G corresponds to a distinct leaf of T and two vertices are adjacent inG if and only if the weighted distance between their corresponding leaves in T is in the interval [dmin, dmax]. Similarly, a given graph G is a PCG if there ...
متن کاملSome classes of graphs that are not PCGs
A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that each node u ∈ V is uniquely associated to a leaf of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax, where dT (u, v) is the sum of the weights of the edges on the unique path PT (u, v) from u to v in T...
متن کاملCharacterizing sub-topical functions
In this paper, we first give a characterization of sub-topical functions with respect to their lower level sets and epigraph. Next, by using two different classes of elementary functions, we present a characterization of sub-topical functions with respect to their polar functions, and investigate the relation between polar functions and support sets of this class of functions. Finally, we obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2020
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00712-8